Generation of Walsh codes in two different orderings using 4-bit Gray and Inverse Gray codes
نویسندگان
چکیده
منابع مشابه
Equivalence classes of 5-bit Gray codes
An n-bit gray code can be represented as a hamilton cycle in the n-cube together with a direction. Two n-bit gray codes are equivalent if there is an automorphism of the n-cube that maps the edge set of one onto the other. In this paper we detail a method for counting the number of equivalence classes of 5-bit gray codes, and classify the equivalence classes according to the distribution of the...
متن کاملBinary Gray Codes with Long Bit Runs
We show that there exists an n-bit cyclic binary Gray code all of whose bit runs have length at least n − 3 log2 n. That is, there exists a cyclic ordering of {0, 1}n such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of n − 3 log2 n consecutive words. Such Gray codes are ‘locally distance preserving’ in that Hamming ...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملAntipodal Gray codes
An n-bit Gray code is a circular listing of the 2 n-bit strings so that successive strings differ only in one bit position. An n-bit antipodal Gray code has the additional property that the complement of any string appears exactly n steps away in the list. The problem of determining for which values of n antipodal Gray codes can exist was posed by Hunter Snevily, who showed them to be possible ...
متن کاملTransition Restricted Gray Codes
A Gray code is a Hamilton path H on the n-cube, Q n. By labeling each edge of Q n with the dimension that changes between its incident vertices, a Gray code can be thought of as a sequence H = t 1 ; t 2 ; : : : ; t N-1 (with N = 2 n and each t i satisfying 1 t i n). The sequence H deenes an (undirected) graph of transitions, G H , whose vertex set is f1; 2; : : : ; ng and whose edge set E(G H) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2012
ISSN: 0974-6846,0974-5645
DOI: 10.17485/ijst/2012/v5i3.29